Nominal classification and anaphora: A comparison between Spanish and Chinese

El género en español y los clasificadores numerales en chino representan dos recursos diferentes para clasificar los nombres. Este trabajo establece una comparación de la clasificación nominal entre español y chino desde la perspectiva de la anáfora. En ambas lenguas, la información clasificatoria puede contribuir a la identificación del referente en algunos casos anafóricos. La coacción que observamos en la clasificación nominal en chino hace posible la interpretación anafórica con la forma no fiel, y además, facilita la retoma del antecedente.Gender in Spanish and numeral classifiers in Chinese represent two different resources for classifying nouns. This paper makes a comparison of the nominal classification between Spanish and Chinese from the perspective of anaphora. In both languages, the classification information can contribute to the identification of the referent in anaphora. The coercion we observe in the nominal classification in Chinese enables the anaphoric interpretation with unfaithful form and also facilitates the location of the antecedent

Zero-crossing intervals of Gaussian and symmetric stable processes

The zero-crossing problem is the determination of the probability density function of the intervals between the successive axis crossings of a stochastic process. This thesis studies the properties of the zero-crossings of stationary processes belonging to the symmetric-stable class of Gaussian and non-Gaussian type, corresponding to the stability index nu=2 and 0<nu<2 respectively

Zero-crossing intervals of Gaussian and symmetric stable processes

The zero-crossing problem is the determination of the probability density function of the intervals between the successive axis crossings of a stochastic process. This thesis studies the properties of the zero-crossings of stationary processes belonging to the symmetric-stable class of Gaussian and non-Gaussian type, corresponding to the stability index nu=2 and 0<nu<2 respectively

A general construction of regular complete permutation polynomials

Let $r\geq 3$ be a positive integer and $\mathbb{F}_q$ the finite field with $q$ elements. In this paper, we consider the $r$-regular complete permutation property of maps with the form $f=\tau\circ\sigma_M\circ\tau^{-1}$ where $\tau$ is a PP over an extension field $\mathbb{F}_{q^d}$ and $\sigma_M$ is an invertible linear map over $\mathbb{F}_{q^d}$. We give a general construction of $r$-regular PPs for any positive integer $r$. When $\tau$ is additive, we give a general construction of $r$-regular CPPs for any positive integer $r$. When $\tau$ is not additive, we give many examples of regular CPPs over the extension fields for $r=3,4,5,6,7$ and for arbitrary odd positive integer $r$. These examples are the generalization of the first class of $r$-regular CPPs constructed by Xu, Zeng and Zhang (Des. Codes Cryptogr. 90, 545-575 (2022)).Comment: 24 page

Regular complete permutation polynomials over quadratic extension fields

Let $r\geq 3$ be any positive integer which is relatively prime to $p$ and $q^2\equiv 1 \pmod r$. Let $\tau_1, \tau_2$ be any permutation polynomials over $\mathbb{F}_{q^2},$ $\sigma_M$ is an invertible linear map over $\mathbb{F}_{q^2}$ and $\sigma=\tau_1\circ\sigma_M\circ\tau_2$. In this paper, we prove that, for suitable $\tau_1, \tau_2$ and $\sigma_M$, the map $\sigma$ could be $r$-regular complete permutation polynomials over quadratic extension fields.Comment: 10 pages. arXiv admin note: substantial text overlap with arXiv:2212.1286

Comparación de la recategorización del sustantivo entre el español y el chino mandarín1

In the framework of Relevance Theory, this paper analyzes the noun recategorization and makes a comparison between Spanish and Mandarin Chinese. Through interlinguistic comparison, it can be confirmed that although there are some differences in noun categories and new interpretations generated through recategorization mechanism, the coercion operation principles in the two languages are the same. Whether in Spanish or Chinese, when there is a conflict between conceptual coding and procedural coding in the process of noun recategorization, it is always solved by procedural coding. In addition, in both languages, the receiver’s knowledge related to nouns is very important for the construction of coercive context

Robust and Low-Complexity Timing Synchronization for DCO-OFDM LiFi Systems

Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Light fidelity (LiFi), using light emitting devices such as light emitting diodes (LEDs) which are operating in the visible light spectrum between 400 and 800 THz, provides a new layer of wireless connectivity within existing heterogeneous radio frequency wireless networks. Link data rates of 10 Gbps from a single transmitter have been demonstrated under ideal laboratory conditions. Synchronization is one of these issues usually assumed to be ideal. However, in a practical deployment, this is no longer a valid assumption. Therefore, we propose for the first time a low-complexity maximum likelihood-based timing synchronization process that includes frame detection and sampling clock synchronization for direct current-biased optical orthogonal frequency division multiplexing LiFi systems. The proposed timing synchronization structure can reduce the high-complexity two-dimensional search to two low-complexity one-dimensional searches for frame detection and sampling clock synchronization. By employing a single training block, frame detection can be realized, and then sampling clock offset (SCO) and channels can be estimated jointly. We propose three frame detection approaches, which are robust against the combined effects of both SCO and the low-pass characteristic of LEDs. Furthermore, we derive the Cramér-Rao lower bounds (CRBs) of SCO and channel estimations, respectively. In order to minimize the CRBs and improve synchronization performance, a single training block is designed based on the optimization of training sequences, the selection of training length, and the selection of direct current (DC) bias. Therefore, the designed training block allows us to analyze the trade-offs between estimation accuracy, spectral efficiency, energy efficiency, and complexity. The proposed timing synchronization mechanism demonstrates low complexity and robustness benefits and provides performance significantly better than achieved with existing methods.Peer reviewe

An optimized QoS scheme for IMS-NEMO in heterogeneous networks

The network mobility (NEMO) is proposed to support the mobility management when users move as a whole. In IP Multimedia Subsystem (IMS), the individual Quality of Service (QoS) control for NEMO results in excessive signaling cost. On the other hand, current QoS schemes have two drawbacks: unawareness of the heterogeneous wireless environment and inefficient utilization of the reserved bandwidth. To solve these problems, we present a novel heterogeneous bandwidth sharing (HBS) scheme for QoS provision under IMS-based NEMO (IMS-NEMO). The HBS scheme selects the most suitable access network for each session and enables the new coming non-real-time sessions to share bandwidth with the Variable Bit Rate (VBR) coded media flows. The modeling and simulation results demonstrate that the HBS can satisfy users' QoS requirement and obtain a more efficient use of the scarce wireless bandwidth